Image Compressive Sensing Recovery Using Group Sparse Coding via Non-convex Weighted Lp Minimization

نویسندگان

  • Zhiyuan Zha
  • Xinggan Zhang
  • Yu Wu
  • Qiong Wang
  • Lan Tang
چکیده

Compressive sensing (CS) has attracted considerable research from signal/image processing communities. Recent studies further show that structured or group sparsity often leads to more powerful signal reconstruction techniques in various CS taskes. Unlike the conventional sparsity-promoting convex regularization methods, this paper proposes a new approach for image compressive sensing recovery using group sparse coding via non-convex weighted `p minimization. To make our scheme tractable and robust, an iterative shrinkage/thresholding (IST) algorithm based technique is adopted to solve the above nonconvex `p minimization problem efficiently. Experimental results have shown that the proposed algorithm outperforms many stateof-the-art techniques for image CS recovery.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Bridge the Gap Between Group Sparse Coding and Rank Minimization via Adaptive Dictionary Learning

Both sparse coding and rank minimization have led to great successes in various image processing tasks. Though the underlying principles of these two approaches are similar, no theory is available to demonstrate the correspondence. In this paper, starting by designing an adaptive dictionary for each group of image patches, we analyze the sparsity of image patches in each group using the rank mi...

متن کامل

Sparse Coding Algorithm with Negentropy and Weighted ℓ1-Norm for Signal Reconstruction

Compressive sensing theory has attracted widespread attention in recent years and sparse signal reconstruction has been widely used in signal processing and communication. This paper addresses the problem of sparse signal recovery especially with non-Gaussian noise. The main contribution of this paper is the proposal of an algorithm where the negentropy and reweighted schemes represent the core...

متن کامل

Image Compressive Sensing Recovery Using Adaptively Learned Sparsifying Basis via L0 Minimization

Frommany fewer acquired measurements than suggested by the Nyquist sampling theory, compressive sensing (CS) theory demonstrates that, a signal can be reconstructed with high probability when it exhibits sparsity in some domain. Most of the conventional CS recovery approaches, however, exploited a set of fixed bases (e.g. DCT, wavelet and gradient domain) for the entirety of a signal, which are...

متن کامل

Phaseless compressive sensing using partial support information

We study the recovery conditions of weighted `1 minimization for real signal reconstruction from phaseless compressed sensing measurements when partial support information is available. A Strong Restricted Isometry Property (SRIP) condition is provided to ensure the stable recovery. Moreover, we present the weighted null space property as the sufficient and necessary condition for the success o...

متن کامل

Compressive Sensing for Background Subtraction

Compressive sensing (CS) is an emerging field that provides a framework for image recovery using sub-Nyquist sampling rates. The CS theory shows that a signal can be reconstructed from a small set of random projections, provided that the signal is sparse in some basis, e.g., wavelets. In this paper, we describe a method to directly recover background subtracted images using CS and discuss its a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1704.07023  شماره 

صفحات  -

تاریخ انتشار 2017